Finding Cliques in Directed Weighted Graphs Using Complex Hermitian Adjacency Matrices
نویسندگان
چکیده
منابع مشابه
An Eigendecomposition Approach to Weighted Graph Matching Problems
Absfruct-This paper discusses an approximate solution to the weighted graph matching prohlem (WGMP) for both undirected and directed graphs. The W G M P is the problem of f inding the opt imum matching between two weighted graphs, which are graphs with weights at each arc. The proposed method employs an analytic, instead of a combinatorial or iterative, approach to the opt imum matching problem...
متن کاملLower Bound on the Chromatic Number by Spectra of Weighted Adjacency Matrices
A lower bound on the chromatic number of a graph is derived by majorization of spectra of weighted adjacency matrices. These matrices are given by Hadamard products of the adjacency matrix and arbitrary Hermitian matrices.
متن کاملSpectral radii of sparse random matrices
We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erdős-Rényi graphs. For the Erdős-Rényi graph G(n, d/n), our results imply that the smallest and second-largest eigenvalues of the adjacency matrix converge to the edges of the support of the asymptotic eigenvalue distribution provided that d log n. Toget...
متن کاملThe Enhanced Principal Rank Characteristic Sequence for Hermitian Matrices
The enhanced principal rank characteristic sequence (epr-sequence) of an n×n matrix is a sequence `1`2 · · ·`n, where each `k is A, S, or N according as all, some, or none of its principal minors of order k are nonzero. There has been substantial work on epr-sequences of symmetric matrices (especially real symmetric matrices) and real skew-symmetric matrices, and incidental remarks have been ma...
متن کاملBipartition of graphs based on the normalized cut and spectral methods
In the first part of this paper, we survey results that are associated with three types of Laplacian matrices:difference, normalized, and signless. We derive eigenvalue and eigenvector formulaes for paths and cycles using circulant matrices and present an alternative proof for finding eigenvalues of the adjacency matrix of paths and cycles using Chebyshev polynomials. Even though each results i...
متن کامل